Mining Frequent Itemsets without Candidate Generation using Optical Neural Network

نویسندگان

  • Divya Bhatnagar
  • Neeru Adlakha
  • A. S. Saxena
  • Morgan Kaufmann
  • Takeaki Uno
  • Masashi Kiyomi
  • Hiroki Arimura
  • Baisheng Wang
  • D. Bhatnagar
  • A. K. Saxena
چکیده

We propose an efficient technique for mining frequent itemsets in large databases making use of Optical Neural Network Model. It eliminates the need to generate candidate sets and joining them for finding frequent itemsets for association rule mining. Since optical neural network performs many computations simultaneously, the time complexity is very low as compared to other data mining techniques. The data is stored in such a way that it minimizes space complexity to a large extent. This paper focuses on how this model can be helpful in generating frequent patterns for various applications. Appropriate methods are also designed that reduces the number of database scans to just one. It is fast, versatile, and adaptive. It discovers frequent patterns by using the best features of data mining, optics and neural networks

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Frequent Closed Itemsets with the Frequent Pattern List

The mining of the complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of frequent closed itemsets (FCIs), which results in a much smaller number of itemsets. The approaches to mining frequent closed itemsets can be categorized into two groups: those with candidate generation and those without. In this paper, we propose...

متن کامل

An Optical Neural Network Model for Mining Frequent Itemsets in Large Databases

This paper proposes a model for mining frequent patterns in large databases by implementing Optical Neural Networks. The whole database is scanned only once and stored as a matrix. The frequent patterns are then mined from this matrix using optical neuron network. This approach is extremely efficient in data mining, as the number of database scans is effectively less than two and all the freque...

متن کامل

Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint

In this paper, we propose a novel data structure called CATS Tree. CATS Tree extends the idea of FPTree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. The proposed algorithms enable frequent pattern mining with different supports without rebuilding the tree structure. Furthermore, the algorithms allow mining with a single pass over the...

متن کامل

OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation

This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an integration of two techniques: a correlogram matrix based technique to generate all the frequent 1and 2-itemset in a single scan over the database and a technique that uses vertical layout concept to generate the rest...

متن کامل

DiffNodesets: An efficient structure for fast mining frequent itemsets

Mining frequent itemsets is an essential problem in data mining and plays an important role in many data mining applications. In recent years, some itemset representations based on node sets have been proposed, which have shown to be very efficient for mining frequent itemsets. In this paper, we propose DiffNodeset, a novel and more efficient itemset representation, for mining frequent itemsets...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011